Checking Semantics Equivalence of MDA Transformations in Concurrent Systems
نویسندگان
چکیده
In a previous work we have proposed an extension to the four-layer MDA architecture promoting formal verification for semantics preserving model transformations. We analyzed semantics equivalence in transformations involving Platform Specific Models (PSM s). In this paper, considering concurrent systems domain, we show how this extended MDA architecture copes with the correctness verification of horizontal model transformations involving Platform Independent Models (PIM s). Our approach is supported by four formal techniques: behavioral equivalence relation, category theory, bisimulation and model-checking. This set of techniques allows the analysis of semantics equivalence between system model before and after transformation enabling the decomposition of the system model into a set of concurrent sub-models, considered as components. The validation of our approach occurs in a net splitting operation, where PIM s are defined as Petri nets models according to the PNML metamodel with transformations representing formal operations in this domain.
منابع مشابه
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak bisimulation and simulation...
متن کاملThe Concurrency Workbench: a Semantics Based Tool for the Veriication of Concurrent Systems
The Concurrency Workbench is an automated tool for analyzing networks of nite-state processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its breadth: a variety of diierent veriication methods, including equivalence checking, preorder checking, and model checking, are supported for several diierent process semantics. One experience from our work is that a large n...
متن کاملBrzozowski's and Up-To Algorithms for Must Testing
Checking language equivalence (or inclusion) of finite automata is a classical problem in Computer Science, which has recently received a renewed interest and found novel and more effective solutions, such as approaches based on antichains or bisimulations up-to. Several notions of equivalence (or preorder) have been proposed for the analysis of concurrent systems. Usually, the problem of check...
متن کاملIndustrial Experiences with a Formal DSL Semantics to Check Correctness of DSL Transformations
A domain specific language (DSL) abstracts from implementation details and is aligned with the way domain experts reason about a software component. The development of DSLs is usually centered around a grammar and transformations that generate implementation code or analysis models. The semantics of the language is often defined implicitly and in terms of a transformation to implementation code...
متن کاملSemantic Equations for Formal Models in the Model-Driven Architecture
Semantic equations are important pieces of the denotational semantics approach that enable the translation of syntactic constructs of models to semantic domains. In a previous work, we have extended the Model-Driven Architecture (MDA) four-layer proposal of architecture in order to incorporate formal semantics to its artifacts. Thus, semantic equations are key elements in this extended architec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. UCS
دوره 15 شماره
صفحات -
تاریخ انتشار 2009